Minimal bricks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal bricks

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n ≥ 5, every minimal brick on 2n vertices has at most 5n − 7 edges, and (2) every minimal br...

متن کامل

Minimal bricks have many vertices of small degree

We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.

متن کامل

Building Bricks with Bricks, with Mathematica

In this work we solve a special case of the problem of building an n-dimensional parallelepiped using a given set of n-dimensional parallelepipeds. Consider the identity x = xHx 1L Hx 2L + 3 xHx 1L + x. For sufficiently large x, we associate with x3 a cube with edges of size x, with x Hx 1L Hx 2L a parallelepiped with edges x, x 1, x 2, with 3 x Hx 1L three parallelepipeds of edges x, x 1, 1, a...

متن کامل

Generating bricks

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. Bricks are building blocks of the matching decomposition procedure of Kotzig, Lovasz and Plummer, and therefore many matching-related problems can be reduced to bricks. We prove, roughly, that every brick other than the Petersen graph can be generated from a “matchin...

متن کامل

Bricks for Reactive Programming

A fundamental unit of computation is introduced for reactive programming called the LEGO R © brick. It is targeted for domains in which JavaScript runs in an attempt to allow a user to build a trustworthy reactive program on demand rather than try to analyze JavaScript. A formal definition is given for snapping bricks together based on the standard product construction for deterministic finite ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2006

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2005.10.005